From Gödel to Einstein: Computability between logic and physics at CiE 2006

نویسندگان

  • Arnold Beckmann
  • Edwin J. Beggs
  • Benedikt Löwe
چکیده

Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical development, and applications. Among the aims of the network is advancing our theoretical understanding of what can and cannot be computed, by any means of computation. Its scientific vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and machines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory or relativity. Computations may be very general, depending upon the foundations of set theory; or very specific, using the combinatorics of finite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere, especially in algebra, analysis and geometry, or data types and programming. The conferences CiE 2005 in Amsterdam and CiE 2006 in Swansea are at the start of a new conference series CiE-CS that will reconvene in 2007 in Siena, 2008 in Athens, 2009 in Heidelberg and 2010 in Ponta Delgada (Açores). CiE 2006 focused on the variety of logical approaches to all kinds of computational barriers, like the practical and feasible ones, centered around the P vs. NP problem; the computable ones connected to models of computers and programming languages; and the hypercomputable ones. These three kinds of barriers are ubiquitous in computability theory: They occur in classical computability theory on discrete data; in computations with continuous data like higher types, real numbers or topological spaces; and in the physical sciences where we find for example quantum computers, analogue computers, and other computing systems based on classical, relativistic and quantum mechanics. The conference provided an interdisciplinary venue for researchers from computer science and mathematics to exchange ideas, approaches and techniques in their respective work, thereby generating a wider community for work

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kurt Gödel and Computability Theory

Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda ...

متن کامل

From Constructibility and Absoluteness to Computability and Domain Independence

Gödel’s main contribution to set theory is his proof that GCH is consistent with ZFC (assuming that ZF is consistent). For this proof he has introduced the important ideas of constructibility of sets, and of absoluteness of formulas. In this paper we show how these two ideas of Gödel naturally lead to a simple unified framework for dealing with computability of functions and relations, domain i...

متن کامل

Gödel and Computability 1

We discuss the influence of Gödel and his results on the surfacing of the rigorous notion of computability afforded by Turing. We also address the debate about the limits of Artificial Intelligence spurned by Roger Penrose, on the basis of Gödel's theorems, and the views of Gödel himself. We conclude by touching upon the use of logic as a tool with which to approach the description of mind.

متن کامل

Metamathematical Results on Formally Undecidable Propositions: Completeness vs. Incompleteness 1. Life and Work

1. Life and work Kurt Gödel was a solitary genius, whose work influenced all the subsequent developments in mathematics and logic. The striking fundamental results in the decade 1929-1939 that made Gödel famous are the completeness of the first-order predicate logic proof calculus, the incompleteness of axiomatic theories containing arithmetic, and the consistency of the axiom of choice and the...

متن کامل

Computability and Incomputability

The conventional wisdom presented in most computability books and historical papers is that there were several researchers in the early 1930’s working on various precise definitions and demonstrations of a function specified by a finite procedure and that they should all share approximately equal credit. This is incorrect. It was Turing alone who achieved the characterization, in the opinion of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 394  شماره 

صفحات  -

تاریخ انتشار 2008